351A - Jeff and Rounding - CodeForces Solution


dp greedy implementation math *1800

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
    int n;cin>>n;
    int a[2*n];
    int cnt=0;
    double ans=1e18, sum=-n;
    for(int i=0;i<2*n;i++){
        double b;cin>>b;
        int p=(int)b;
        if(b-p==0)cnt++;
        sum+=b-p;
    }
    for(int i=0;i<=min(cnt, n);i++){
        ans=min(abs(sum+i), ans);
    }
    cout<<fixed<<setprecision(3)<<ans<<endl;

}


Comments

Submit
0 Comments
More Questions

50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns
1374C - Move Brackets
1476A - K-divisible Sum
1333A - Little Artem
432D - Prefixes and Suffixes
486A - Calculating Function
1373B - 01 Game
1187A - Stickers and Toys
313B - Ilya and Queries
579A - Raising Bacteria
723A - The New Year Meeting Friends
302A - Eugeny and Array
1638B - Odd Swap Sort
1370C - Number Game
1206B - Make Product Equal One